1238A - Prime Subtraction - CodeForces Solution


math number theory *900

Please click on ads to support us..

Python Code:

for _ in[0]*int(input()):x,y=map(int,input().split());print('YNEOS'[x-y<2::2])

C++ Code:

#include<bits/stdc++.h>
using namespace std;
const int N= 2e5+10;
int main()
{
 	int t;
 	cin>>t;
 	while(t--)
 	{
  		long long x, y;
  		cin>>x>>y;
  		if(x - y == 1) cout<<"NO"<<endl;
  		else cout<<"YES"<<endl;
 	}
 	return 0;
}
	 		  			   		  	   		    	  		


Comments

Submit
0 Comments
More Questions

1333A - Little Artem
432D - Prefixes and Suffixes
486A - Calculating Function
1373B - 01 Game
1187A - Stickers and Toys
313B - Ilya and Queries
579A - Raising Bacteria
723A - The New Year Meeting Friends
302A - Eugeny and Array
1638B - Odd Swap Sort
1370C - Number Game
1206B - Make Product Equal One
131A - cAPS lOCK
1635A - Min Or Sum
474A - Keyboard
1343A - Candies
1343C - Alternating Subsequence
1325A - EhAb AnD gCd
746A - Compote
318A - Even Odds
550B - Preparing Olympiad
939B - Hamster Farm
732A - Buy a Shovel
1220C - Substring Game in the Lesson
452A - Eevee
1647B - Madoka and the Elegant Gift
1408A - Circle Coloring
766B - Mahmoud and a Triangle
1618C - Paint the Array
469A - I Wanna Be the Guy